Online Hierarchical Graph Drawing
نویسندگان
چکیده
We propose a heuristic for maintaining dynamic hierarchical graph layouts. The heuristic is an on-line interpretation of the static layout algorithm of Sugiyama, Togawa and Toda. It incorporates topological and geometric information with the objective of making layout animations that are both incrementally stable and readable through long editing sequences. We present measurements of an experimental prototype using generated test data. Applications include incremental graph browsing and editing, the display of dynamic data structures and networks, and browsing large graphs.
منابع مشابه
Convex Drawings of Hierarchical Plane Graphs
This paper proves that every internally triconnected hierarchical plane graph with the outer facial cycle drawn as a convex polygon admits a convex drawing. We present an algorithm which constructs such a drawing. This extends the previous known result that every hierarchical plane graph admits a straight-line drawing.
متن کاملConvex drawings of hierarchical planar graphs and clustered planar graphs
Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...
متن کاملStudy of Proper Hierarchical Graphs on a Grid
Hierarchical planar graph embedding (sometimes called level planar graphs) is widely recognized as a very important task in diverse fields of research and development. Given a proper hierarchical planar graph, we want to find a geometric position of every vertex (layout) in a straight-line grid drawing without any edge-intersection. An additional objective is to minimize the area of the rectang...
متن کاملNavigating Clustered Graphs Using Force-Directed Methods
Graphs which arise in Information Visualization applications are typically very large: thousands, or perhaps millions of nodes. Current graph drawing methods successfully deal with (at best) a few hundred nodes. This paper describes a strategy for the visualization and navigation of graphs. The strategy has three elements: 1. A layered architecture, called CGA, for handling clustered graphs: th...
متن کاملFlexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarchies, or database schemas can be modelled by graphs and represented visually using graph drawing algorithms. Most existing graph drawing algorithms do not consider the size of nodes when creating a drawing. In most real...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001